Complementary Iterated Floor Words and the Flora Game
نویسندگان
چکیده
منابع مشابه
Complementary Iterated Floor Words and the Flora Game
Let φ = (1+ √ 5)/2 denote the golden section. We investigate relationships between unbounded iterations of the floor function applied to various combinations of φ and φ2. We use them to formulate an algebraic polynomial-time winning strategy for a new four-pile take-away game Flora, which is motivated by partitioning the set of games into subsets CompGames and PrimGames. We further formulate re...
متن کاملUnbounded Iterations of Floor Functions and the Flora Game
Partition the set of games into subsets CompGames and PrimGames, precipitating a new 4-pile take-away game Flora. Let φ = (1 + √ 5)/2 denote the golden section. We investigate relationships between unbounded iterations of the floor function applied to various combinations of φ and φ. We use them to formulate an algebraic polynomial-time winning strategy for Flora, and also present recursive, ar...
متن کاملIterated crowdsourcing dilemma game
The Internet has enabled the emergence of collective problem solving, also known as crowdsourcing, as a viable option for solving complex tasks. However, the openness of crowdsourcing presents a challenge because solutions obtained by it can be sabotaged, stolen, and manipulated at a low cost for the attacker. We extend a previously proposed crowdsourcing dilemma game to an iterated game to add...
متن کاملConvergence Of The Iterated Prisoner's Dilemma Game
Co-learning is a model involving agents from a large population, who interact by playing a fixed game and update their behaviour based on previous experience and the outcome of this game. The Highest Cumulative Reward rule is an update rule which ensures the emergence of cooperation in a population of agents without centralized control, for various games and interaction topologies. We analyse t...
متن کاملConsensus Game Acceptors and Iterated Transductions
We study a game for recognising formal languages, in which two players with imperfect information need to coordinate on a common decision, given private input words correlated by a finite graph. The players have a joint objective to avoid an inadmissible decision, in spite of the uncertainty induced by the input. We show that the acceptor model based on consensus games characterises context-sen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2010
ISSN: 0895-4801,1095-7146
DOI: 10.1137/090758994